Convergence of a preconditioned iterative method for H-matrices
نویسندگان
چکیده
منابع مشابه
Improvements of two preconditioned AOR iterative methods for Z-matrices
In this paper, we propose two preconditioned AOR iterative methods to solve systems of linear equations whose coefficient matrices are Z-matrix. These methods can be considered as improvements of two previously presented ones in the literature. Finally some numerical experiments are given to show the effectiveness of the proposed preconditioners.
متن کاملConvergence Analysis of Preconditioned AOR Iterative Method for Linear Systems
MHmatrices appear in many areas of science and engineering, for example, in the solution of the linear complementarity problem LCP in optimization theory and in the solution of large systems for real-time changes of data in fluid analysis in car industry. Classical stationary iterative methods used for the solution of linear systems have been shown to convergence for this class of matrices. In ...
متن کاملPreconditioned Mixed-Type Splitting Iterative Method For Z-Matrices
In this paper, we present the preconditioned mixed-type splitting iterative method for solving the linear systems, Ax = b, where A is a Z-matrix. And we give some comparison theorems to show that the convergence rate of the preconditioned mixed-type splitting iterative method is faster than that of the mixed-type splitting iterative method. Finally, we give a numerical example to illustrate our...
متن کاملPreconditioned SSOR Iterative Method For Linear System With M-Matrices
A preconditioned SSOR iterative method with a multi-parameters preconditioner I + S̃α is proposed. Some convergence and comparison results for αi ∈ [0, 1] are given when the coefficient matrix of linear system A is a nonsingular M−matrix. Numerical example shows that our methods are superior to the basic SSOR iterative method.
متن کاملPreconditioned Gauss-seidel Iterative Method for Z-matrices Linear Systems
For Ax = b, it has recently been reported that the convergence of the preconditioned Gauss-Seidel iterative method which uses a matrix of the type P = I + S (α) to perform certain elementary row operations on is faster than the basic Gauss-Seidel method. In this paper, we discuss the adaptive Gauss-Seidel iterative method which uses P = I + S (α) + K̄ (β) as a preconditioner. We present some com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1997
ISSN: 0377-0427
DOI: 10.1016/s0377-0427(97)00145-3